Recognizable Tree Series with Discounting
نویسندگان
چکیده
We consider weighted tree automata with discounting over commutative semirings. For their behaviors we establish a Kleene theorem and an MSOlogic characterization. We introduce also weighted Muller tree automata with discounting over the max-plus and the min-plus semirings, and we show their expressive equivalence with two fragments of weighted MSO-sentences.
منابع مشابه
Does o-Substitution Preserve Recognizability?
Substitution operations on tree series are at the basis of systems of equations (over tree series) and tree series transducers. Tree series transducers seem to be an interesting transformation device in syntactic pattern matching. In this contribution, it is shown that o-substitution preserves recognizable tree series provided that the target tree series is linear and the semiring is idempotent...
متن کاملSeries, Weighted Automata, Probabilistic Automata and Probability Distributions for Unranked Trees
We study tree series and weighted tree automata over unranked trees. The message is that recognizable tree series for unranked trees can be defined and studied from recognizable tree series for binary representations of unranked trees. For this we prove results of [1] as follows. We extend hedge automata – a class of tree automata for unranked trees – to weighted hedge automata. We define weigh...
متن کاملCut sets as recognizable tree languages
A tree series over a semiring with partially ordered carrier set can be considered as a fuzzy set. We investigate conditions under which it can also be understood as a fuzzi ed recognizable tree language. In this sense, su cient conditions are presented which, when imposed, ensure that every cut set, i.e., the pre-image of a prime lter of the carrier set, is a recognizable tree language. Moreov...
متن کاملMyhill-Nerode Theorem for Recognizable Tree Series Revisited
In this contribution the Myhill-Nerode congruence relation on tree series is reviewed and a more detailed analysis of its properties is presented. It is shown that, if a tree series is deterministically recognizable over a zero-divisor free and commutative semiring, then the Myhill-Nerode congruence relation has finite index. By [Borchardt: Myhill-Nerode Theorem for Recognizable Tree Series. LN...
متن کاملLearning Deterministically Recognizable Tree Series
We devise a learning algorithm for deterministically recognizable tree series where the weights are taken from a commutative group. For this, we use an adaptation of the minimal adequate teacher model that was originally introduced by Angluin. The algorithm runs in polynomial time and constructs the unique minimal deterministic bottom-up finite state weighted tree automaton that recognizes the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Acta Cybern.
دوره 19 شماره
صفحات -
تاریخ انتشار 2009